Towards Fully Jitterless Applications: Periodic Scheduling in Multiprocessor MCSs Using a Table-Driven Approach
نویسندگان
چکیده
منابع مشابه
Periodic Multiprocessor Scheduling
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملTowards a Periodic Table of Connectors
Connectors are the glue for combining components and are a critical aspect of software architecture design. Providing a framework similar in spirit to that of the periodic table of chemical elements, this work strives to obtain a set of high level canonical properties that can describe all possible connectors and allow operations to be de ned over them. Connector factorization obtains a new con...
متن کاملTowards a “Periodic Table of Component Models”
When applying model-driven architecture to component models, a significant issue is to address challenges such as component architecture transformation, compositional consistency analysis, and component code synthesis in a reusable way. Mostly, this is due to the substantial differences among abstractions of component models. As a remedy, the paper presents Periodic Table of Component Models (P...
متن کاملTowards a Periodic Table of Gestural Interaction
The periodic table is the first means of chemists to structure their field of research. It comprises all chemical elements with their most prominent features. The system is so important that students of chemistry usually learn it by heart during their university education. Scientists in the field of human-computer interaction lack such a concise system that covers all aspects of gestural intera...
متن کاملA parallel approach for multiprocessor scheduling
A bstrad The objective of this research is to propose cl lowc.omplexit)* static scheduling and allocation algorithm for message-passing architectures bv c.on.sidering .factor.s such as communicution delays, link contention, messcz routing and network topology. As opposed to fi r t e ( onventiomzl list-scheduling ap rouch. our technique \,rtork.s by ,first serializing the tas .f graph and “injec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2020
ISSN: 2076-3417
DOI: 10.3390/app10196702